Bounding the spectrum of large Hermitian matrices
نویسندگان
چکیده
Estimating upper bounds of the spectrum of large Hermitian matrices has long been a problem with both theoretical and practical significance. Algorithms that can compute tight upper bounds with minimum computational cost will have applications in a variety of areas. We present a practical algorithm that exploits k-step Lanczos iteration with a safeguard step. The k is generally very small, say 5 to 8, disregard of the large dimension of the matrices. This makes the Lanczos iteration economical. The safeguard step can be realized with marginal cost by utilizing the theoretical bounds developed in this paper. The bounds establish the theoretical validity of a previous bound estimator that has been successfully used in various applications. Moreover, we improve the bound estimator which can now provide tighter upper bounds with negligible additional cost.
منابع مشابه
A strategy for detecting extreme eigenvalues bounding gaps in the discrete spectrum of self-adjoint operators
For a self-adjoint linear operator with discrete spectrum or a Hermitian matrix the “extreme” eigenvalues define the boundaries of clusters in the spectrum of real eigenvalues. The outer extreme ones are the largest and the smallest eigenvalues. If there are extended intervals in the spectrum in which no eigenvalues are present, the eigenvalues bounding these gaps are the inner extreme eigenval...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملConvergence Properties of Hermitian and Skew Hermitian Splitting Methods
In this paper we consider the solutions of linear systems of saddle point problems. By using the spectrum of a quadratic matrix polynomial, we study the eigenvalues of the iterative matrix of the Hermitian and skew Hermitian splitting method.
متن کاملOn the Spectrum of Sum and Product of Non-hermitian Random Matrices
In this note, we revisit the work of T. Tao and V. Vu on large non-hermitian random matrices with independent and identically distributed (i.i.d.) entries with mean zero and unit variance. We prove under weaker assumptions that the limit spectral distribution of sum and product of nonhermitian random matrices is universal. As a byproduct, we show that the generalized eigenvalues distribution of...
متن کاملA Generalization of Saad ' s Theorem
Let (; x) be an eigenpair of the Hermitian matrix A of order n and let (; u) be a Ritz pair from a subspace K of C 2. Saad has given a simple inequality bounding sin \(x; u) in terms of sin \(x; K). In this note we show that this inequality can be extended to an equally simple inequality for eigenspaces of non-Hermitian matrices. ABSTRACT Let (; x) be an eigenpair of the Hermitian matrix A of o...
متن کامل